Practical Database Searching

نویسندگان

  • Steven E. Brenner
  • Bruce W. Erickson
چکیده

trends guide to bioinformatics 0167-7799/98/$ – see front matter © 1998 Elsevier Science. All rights reserved. More sequences have been putatively characterized by database searches than by any other single technology. For good reason: programs like BLAST are fast and reliable. However, sequence comparison procedures should be treated as experiments analogous to standard laboratory procedures.Their use deserves the same care both in the design of the experiment and in the interpretation of results. The database search experiment Design of a BLAST database search requires consideration of what information is to be gained about the query sequence of interest. The main constraint is that database searching can only reveal similarity. However, from this similarity, homology (i.e. evolutionary relationship) can be inferred and, from that, one might be able to infer function. Although the former inference is now reliable Steven E. Brenner Dept of Structural Biology, Stanford University, Stanford, CA 94305-5400, USA. [email protected] Practical database searching

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

وضعیت بازیابی اطلاعات در دو پایگاه نمایه و نما و سنجش اثربخشی استفاده از واژگان کنترل ‌شده در نمایه‌سازی این دو پایگاه

Purpose: This study was carried out to determine the level of precision, recall, and searching time for “Nama” and “Namayeh” databases, as well as to find out which of the indexing tools (thesaurus and Dewey decimal classification) helps us more in improvement of information retrieval. Methodology: This study is an analytical survey in which the necessary data was collected by direct observati...

متن کامل

A Survey of Algorithms and Data Structures for Range Searching*

An important problem in database systems is answering queries quickly. This paper surveys a number of algorithms for efficiently answering range queries. First a set of “loGical structures” is described and ‘then their implementation in primary and secondary memories is discussed. The algorithms included are of both “practical” and “theoretical” interest. Although some new results are presented...

متن کامل

Archetype relational mapping - a practical openEHR persistence solution

BACKGROUND One of the primary obstacles to the widespread adoption of openEHR methodology is the lack of practical persistence solutions for future-proof electronic health record (EHR) systems as described by the openEHR specifications. This paper presents an archetype relational mapping (ARM) persistence solution for the archetype-based EHR systems to support healthcare delivery in the clinica...

متن کامل

A Pragmatic Approach to Model and Exploit the Semantics of Product Information

Recently researchers have tried to apply ontology to the product information domain. From a practical point of view, a key problem to streamline this trend is how to make a product ontology database operational. Technical solutions should consider the characteristics that a pragmatic product ontology database contains; first, the database size is quite huge, and second, ontological manipulation...

متن کامل

مدل پیشنهادی بازنمائی مکانی مجموعه منابع کتابخانه با استفاده از جی‌آی‌اس (مطالعه موردی: کتابخانه مرکزی دانشگاه تهران)

Introduction: Considering the library users’ difficulty in searching and finding the location of the available sources in the library and their lack of familiarity with the ranking systems, the current study was conducted primarily to propose a model of mapping library collection through geographical information system (GIS), and, secondarily, to implement it in mapping library collection at th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998